منابع مشابه
Fast Linear Transformations in Python
This paper introduces a new free library for the Python programming language, which provides a collection of structured linear transforms, that are not represented as explicit two dimensional arrays but in a more efficient way by exploiting the structural knowledge. This allows fast and memory savy forward and backward transformations while also provding a clean but still flexible interface to ...
متن کاملFast 3D Image Transformations for Registration Procedures
Current automated intensity-based registration procedures make use of similarity functions computed with joint histograms, such as the well-known Mutual Information or the recent Correlation Ratio. We notice that the computation of such histograms represents up to 90% of time of the whole process. We propose in this work a method to accelerate the computation of these histograms in the case of ...
متن کاملFast Color Space Transformations Using Minimax Approximations
Color space transformations are frequently used in image processing, graphics, and visualization applications. In many cases, these transformations are complex nonlinear functions, which prohibits their use in time-critical applications. In this paper, we present a new approach called Minimax Approximations for Color-space Transformations (MACT). We demonstrate MACT on three commonly used color...
متن کاملFast Radial Symmetry Detection Under Affine Transformations
The fast radial symmetry (FRS) transform has been very popular for detecting interest points based on local radial symmetry1. Though, FRS delivers good performance at a relatively low computational cost and is very well suited for a variety of real-time computer vision applications, it is not invariant to perspective distortions. However, even perfectly (radially) symmetric visual patterns in t...
متن کاملFast Geometric Transformations on Quantum Images
Circuits to achieve geometric transformations including two-point swapping, flip, coordinate swapping, orthogonal rotations and their variants on N-sized quantum images are proposed based on the basic quantum gates; NOT, CNOT and Toffoli gates. The complexity of the circuits is O(log N) for two-point swapping and O(log N) for flip, co-ordinate swapping and orthogonal rotations. The results indi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Complexity
سال: 2007
ISSN: 0885-064X
DOI: 10.1016/j.jco.2006.12.004